Belief Functions on Formulas in Lukasiewicz Logic
نویسنده
چکیده
Belief functions are generalized to formulas in Lukasiewicz logic. It is shown that they generalize probabilities on formulas (so-called states) and that they are completely monotone mappings with respect to the lattice operations.
منابع مشابه
Neural Networks and Rational à Lukasiewicz Logic
In this paper we shall describe a correspondence between Rational à Lukasiewicz formulas and neural networks in which the activation function is the truncated identity and synaptic weights are rational numbers. On one hand to have a logical representation (in a given logic) of neural networks could widen the interpretability, amalgamability and reuse of these objects. On the other hand, neural ...
متن کامل{\L}ukasiewicz {\mu}-calculus
The paper explores properties of the Lukasiewicz μ-calculus, or Lμ for short, an extension of Lukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe that Lμ terms, with n variables, define monotone piecewise linear functions from [0, 1]n to [0, 1]. Two effective procedures for calculating the output of Lμ terms on rational i...
متن کاملThe Complexity of Fuzzy Logic
We show that the set of valid formulas in Lukasiewicz predicate logic is a complete Π 2 set. We also show that the classically valid formulas are exactly those formulas in the classical language whose fuzzy value is 1/2. Lukasiewicz’ infinite valued logic can be seen as a particular “implementation” of fuzzy logic. The set of possible “truth values” (or, in another interpretation, degrees of ce...
متن کاملSOFT TOPOLOGY AND SOFT PROXIMITY AS FUZZY PREDICATES BY FORMULAE OF LUKASIEWICZ LOGIC
In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.
متن کاملG . Metcalfe Giles ’ s Game and the Proof Theory of Lukasiewicz Logic
In the 1970s, Robin Giles introduced a game combining Lorenzen-style dialogue rules with a simple scheme for betting on the truth of atomic statements, and showed that the existence of winning strategies for the game corresponds to the validity of formulas in Lukasiewicz logic. In this paper, it is shown that ‘disjunctive strategies’ for Giles’s game, combining ordinary strategies for all insta...
متن کامل